Dynamic Modified Chaotic Particle Swarm Optimization for Radar Signal Sorting

نویسندگان

چکیده

Radar signal sorting is the core part of electronic support measures, which responsible for deinterleaving overlapping pulse sequences received by receiver from complex environment, separating different radiation source signals, and providing identification. Particle swarm optimization (PSO) a population-based global algorithm with great advantages in intelligent can adapt to electromagnetic environment variable signals high stream density. However, PSO-based method prone premature convergence cannot adaptively adjust particle parameters positions. In this paper, dynamic modified chaotic PSO (DMCPSO) proposed. Chaotic search used increase diversity later iteration avoid falling into local optimum. Adaptive adjustment related fitness value are adopted balance ability search. A new function proposed position dynamically corrected clustering analysis improve accuracy influence distribution feature parameters. The simulation results show that DMCPSO provides stable fast performance excellent indexes complex, variable, dense environment.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified Particle Swarm Optimization

Particle Swarm Optimization (PSO) is a very popular optimization technique, but it suffers from a major drawback of a possible premature convergence i.e. convergence to a local optimum and not to the global optimum. This paper attempts to improve on the reliability of PSO by addressing the drawback. This problem of premature convergence is more probable with the problems, which have the global ...

متن کامل

Modified Particle Swarm Optimization for Optimization Problems

In the paper a modified particle swarm optimization (MPSO) is proposed where concepts from firefly algorithm (FA) are borrowed to enhance the performance of particle swarm optimization (PSO). The modifications focus on the velocity vectors of the PSO, which fully use beneficial information of the position of particles and increase randomization item in the PSO. Finally, the performance of the p...

متن کامل

Chaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks

Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...

متن کامل

Chaotic Rough Particle Swarm Optimization Algorithms

The problem of finding appropriate representations for various is a subject of continued research in the field of artificial intelligence and related fields. In some practical situations, mathematical and computational tools for faithfully modeling or representing systems with uncertainties, inaccuracies or variability in computation should be provided; and it is preferable to develop models th...

متن کامل

A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization

This paper introduces a modified PSO, Non-dominated Sorting Particle Swarm Optimizer (NSPSO), for better multiobjective optimization. NSPSO extends the basic form of PSO by making a better use of particles’ personal bests and offspring for more effective nondomination comparisons. Instead of a single comparison between a particle’s personal best and its offspring, NSPSO compares all particles’ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3091005